Minkowski sum of polytopes defined by their vertices
نویسندگان
چکیده
Minkowski sums are of theoretical interest and have applications in fields related to industrial backgrounds. In this paper we focus on the specific case of summing polytopes as we want to solve the tolerance analysis problem described in [1]. Our approach is based on the use of linear programming and is solvable in polynomial time. The algorithm we developped can be implemented and parallelized in a very easy way. keywords: Computational Geometry, Polytope, Minkowski Sum, Linear Programming, Convex Hull.
منابع مشابه
Maximal f-vectors of Minkowski sums of large numbers of polytopes
It is known that in the Minkowski sum of r polytopes in dimension d, with r < d, the number of vertices of the sum can potentially be as high as the product of the number of vertices in each summand [2]. However, the number of vertices for sums of more polytopes was unknown so far. In this paper, we study sums of polytopes in general orientations, and show a linear relation between the number o...
متن کاملOn the Hardness of Computing Intersection, Union and Minkowski Sum of Polytopes
For polytopes P1, P2 ⊂ R we consider the intersection P1 ∩ P2, the convex hull of the union CH(P1 ∪ P2), and the Minkowski sum P1 + P2. For Minkowski sum we prove that enumerating the facets of P1+P2 is NPhard if P1 and P2 are specified by facets, or if P1 is specified by vertices and P2 is a polyhedral cone specified by facets. For intersection we prove that computing the facets or the vertice...
متن کاملMinkowski sum of HV-polytopes in Rn
Minkowski sums cover a wide range of applications in many different fields like algebra, morphing, robotics, mechanical CAD/CAM systems ... This paper deals with sums of polytopes in a n dimensional space provided that both H-representation and V-representation are available i.e. the polytopes are described by both their half-spaces and vertices. The first method uses the polytope normal fans a...
متن کاملAlgorithm to calculate the Minkowski sums of 3-polytopes dedicated to tolerance analysis
Prompted by the development of algorithms for analysing geometric tolerancing, this article describes a method to determine the Minkowski sum for 3-dimension polytopes. This purposed method is based exclusively on intersection operations on normal cones, using the properties of the normal fan of a Minkowski sum obtained by common refinement of the normal fans of the operands. It can be used to ...
متن کاملA Geometric Approach for the Upper Bound Theorem for Minkowski Sums of Convex Polytopes
We derive tight expressions for the maximum number of k-faces, 0 ≤ k ≤ d − 1, of the Minkowski sum, P1+⋯+Pr, of r convex d-polytopes P1, . . . , Pr in R, where d ≥ 2 and r < d, as a (recursively defined) function on the number of vertices of the polytopes. Our results coincide with those recently proved by Adiprasito and Sanyal [1]. In contrast to Adiprasito and Sanyal’s approach, which uses to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1412.2564 شماره
صفحات -
تاریخ انتشار 2014